"'k,r' Semi Strong Chromatic Number of a Graph"
نویسندگان
چکیده
منابع مشابه
(k,r) - Semi Strong Chromatic Number of a Graph
Let G = (V, E) be a simple, finite, undirected graph. Let k, r be positive integers. A set S V (G) is called (k, r)-semi strongly stable set if | (u) S| k, for all u V (G). A partition of V(G) into (k, r)-semi strongly stable sets is called (k, r)-semi strong coloring of G. The minimum order of a (k, r)-semi strong coloring of G is called (k, r)-semi strong chromatic number of G and it is...
متن کاملtotal dominator chromatic number of a graph
given a graph $g$, the total dominator coloring problem seeks aproper coloring of $g$ with the additional property that everyvertex in the graph is adjacent to all vertices of a color class. weseek to minimize the number of color classes. we initiate to studythis problem on several classes of graphs, as well as findinggeneral bounds and characterizations. we also compare the totaldominator chro...
متن کاملChromatic number and minimum degree of Kr+1-free graphs
Let (G) be the minimum degree of a graph G: A number of results about trianglefree graphs determine the maximum chromatic number of graphs of order n with (G) n=3: In this paper these results are extended to Kr+1-free graphs of order n with (G) (1 2= (2r 1))n: In particular: (a) there exist Kr+1-free graphs of order n with (G) > (1 2= (2r 1))n o (n) and arbitrary large chromatic number; (b) if ...
متن کاملThe set chromatic number of a graph
For a nontrivial connected graph G, let c : V (G) → N be a vertex coloring of G where adjacent vertices may be colored the same. For a vertex v of G, the neighborhood color set NC(v) is the set of colors of the neighbors of v. The coloring c is called a set coloring if NC(u) 6= NC(v) for every pair u, v of adjacent vertices of G. The minimum number of colors required of such a coloring is calle...
متن کاملThe Chromatic Number of a Signed Graph
In 1982, Zaslavsky introduced the concept of a proper vertex colouring of a signed graph G as a mapping φ : V (G) → Z such that for any two adjacent vertices u and v the colour φ(u) is different from the colour σ(uv)φ(v), where is σ(uv) is the sign of the edge uv. The substantial part of Zaslavsky’s research concentrated on polynomial invariants related to signed graph colourings rather than on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2011
ISSN: 0975-8887
DOI: 10.5120/2486-3354